class Solution {
public:
    int maxFreqSum(string s) {
        int count[26] = { 0 };
        for (int i = 0; i < s.size(); i++)
            count[s[i] - 'a']++;

        int yuan = 0, fu = 0;
        for (int i = 0; i < 26; i++) {
            if (i + 'a' == 'a' || i + 'a' == 'e' || i + 'a' == 'i' || i + 'a' == 'o' || i + 'a' == 'u')
                yuan = max(yuan, count[i]);
            else fu = max(fu, count[i]);
        }

        return yuan + fu;
    }
};